Finding a bounded mixed-integer solution to a system of dual network inequalities
نویسنده
چکیده
We show that using max-algebraic techniques it is possible to generate the set of all solutions to a system of inequalities xi xj bij ; i; j = 1; :::; n using n generators. This e¢ cient description enables us to develop a pseudopolynomial algorithm which either nds a bounded mixed-integer solution, or decides that no such solution exists. AMS Classi cation [2000]: Primary 68Q25, 15A18; Secondary 90C10, 90C35, 15A36.
منابع مشابه
A Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملA Two Stage Stochastic Programming Model of the Price Decision Problem in the Dual-channel Closed-loop Supply Chain
In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...
متن کاملGeneration of a reduced first - level mixed integer programmimg problem
We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is...
متن کاملA Mixed Integer Programming Approach to Optimal Feeder Routing for Tree-Based Distribution System: A Case Study
A genetic algorithm is proposed to optimize a tree-structured power distribution network considering optimal cable sizing. For minimizing the total cost of the network, a mixed-integer programming model is presented determining the optimal sizes of cables with minimized location-allocation cost. For designing the distribution lines in a power network, the primary factors must be considered as m...
متن کاملBi-objective optimization of a blood supply chain network with reliability of blood centers
This paper presents a multi-periodic, multi-echelon blood supply chain network consisting of blood donors, mobile collection units, local blood centers, main blood centers and demand points in which the local and main blood centers are subject to random failure in dispatching blood products to demand points. The problem has two objectives including minimization of the total chain costs and maxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008